Nuprl Lemma : cless-eq-loc 11,40

E,X1,X2:Type, info:(E((:Id  X1) + (:(:IdLnk  E X2))), pred?:(E(?E)).
SWellFounded(pred!(e;e'))
 (e:E. ((first(e)))  (loc(pred(e)) = loc(e Id))
 (e,e':E. (loc(e) = loc(e' Id)  (pred?(e) = pred?(e'))  (e = e'))
 (e,e':E.
 (loc(e) = loc(e' Id)
  e < e'
  (e rel_plus(E; (x,y. ((first(y))) c (x = pred(y E))) e')) 
latex


Definitionstrans(Tx,y.E(x;y)), rel_implies(TR1R2), xt(x), P  Q, P  Q, rcv?(e), sender(e), A c B, guard(T), x f y, rel_plus(TR), e < e', b, first(e), prop{i:l}, pred(e), loc(e), SWellFounded(R(x;y)), x,yt(x;y), pred!(e;e'), Unit, Id, IdLnk, t  T, x:AB(x), A, False, P  Q, wellfounded{i:l}(Ax,y.R(x;y))
Lemmaspred-total, IdLnk wf, Id wf, unit wf, pred! wf, strongwellfounded wf, loc wf, pred wf, first wf, assert wf, not wf, cless wf, wellfounded functionality wrt implies, strongwf-implies, sender wf, rcv? wf, rel plus strongwellfounded, rel plus monotone, rel plus trans

origin